Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(eq, x)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y)))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(le, x), y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(cons, app2(app2(min, x), y))
APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(le, x)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(if, app2(app2(le, x), y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(del, x), z)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, y), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(eq, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(if, app2(app2(eq, x), y)), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, x), z)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(app2(le, x), y)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(cons, y), app2(app2(del, x), z))
APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(eq, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(min, x)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(min, x), y)
APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(app2(eq, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(del, app2(app2(min, x), y))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(le, x)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(if, app2(app2(eq, x), y))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(min, y)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(eq, x)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y)))
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(filter2, app2(f, x)), f), x)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(le, x), y)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(cons, app2(app2(min, x), y))
APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(le, x)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(if, app2(app2(le, x), y))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(cons, x), app2(app2(filter, f), xs))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(del, x), z)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, y), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(filter2, app2(f, x))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(eq, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(if, app2(app2(eq, x), y)), z)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(filter2, app2(f, x)), f)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, x), z)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(filter, f)
APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(app2(le, x), y)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(cons, y), app2(app2(del, x), z))
APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(eq, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(min, x)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(min, x), y)
APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(app2(eq, x), y)
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(filter, f)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(del, app2(app2(min, x), y))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(le, x)
APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(if, app2(app2(eq, x), y))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z))
APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(cons, x)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(minsort, app2(app2(cons, x), y)) -> APP2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(cons, app2(f, x))
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(min, y)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 6 SCCs with 29 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(app2(eq, x), y)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(eq, app2(s, x)), app2(s, y)) -> APP2(app2(eq, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( s ) = 1


POL( APP2(x1, x2) ) = max{0, x2 - 1}


POL( eq ) = 1


POL( app2(x1, x2) ) = x1 + x2 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(del, x), z)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(del, x), app2(app2(cons, y), z)) -> APP2(app2(del, x), z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( APP2(x1, x2) ) = max{0, x2 - 1}


POL( del ) = max{0, -1}


POL( app2(x1, x2) ) = x1 + x2 + 1


POL( cons ) = 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(app2(le, x), y)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(le, app2(s, x)), app2(s, y)) -> APP2(app2(le, x), y)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( le ) = 1


POL( s ) = 1


POL( APP2(x1, x2) ) = max{0, x2 - 1}


POL( app2(x1, x2) ) = x1 + x2 + 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, x), z)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, y), z)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, x), z)
APP2(app2(min, x), app2(app2(cons, y), z)) -> APP2(app2(min, y), z)
The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( min ) = 1


POL( APP2(x1, x2) ) = x2 + 1


POL( app2(x1, x2) ) = x1 + x2


POL( cons ) = 1



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

APP2(minsort, app2(app2(cons, x), y)) -> APP2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y)))

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be oriented strictly and are deleted.


APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
APP2(app2(filter, f), app2(app2(cons, x), xs)) -> APP2(f, x)
APP2(app2(map, f), app2(app2(cons, x), xs)) -> APP2(app2(map, f), xs)
The remaining pairs can at least be oriented weakly.

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)
Used ordering: Polynomial Order [17,21] with Interpretation:

POL( map ) = max{0, -1}


POL( eq ) = 1


POL( min ) = 1


POL( 0 ) = 1


POL( s ) = max{0, -1}


POL( APP2(x1, x2) ) = x2 + 1


POL( nil ) = max{0, -1}


POL( cons ) = 1


POL( true ) = 1


POL( filter ) = max{0, -1}


POL( del ) = 0


POL( if ) = 1


POL( false ) = max{0, -1}


POL( app2(x1, x2) ) = x1 + x2


POL( le ) = 1


POL( filter2 ) = max{0, -1}


POL( minsort ) = max{0, -1}



The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

APP2(app2(app2(app2(filter2, true), f), x), xs) -> APP2(app2(filter, f), xs)
APP2(app2(app2(app2(filter2, false), f), x), xs) -> APP2(app2(filter, f), xs)

The TRS R consists of the following rules:

app2(app2(le, 0), y) -> true
app2(app2(le, app2(s, x)), 0) -> false
app2(app2(le, app2(s, x)), app2(s, y)) -> app2(app2(le, x), y)
app2(app2(eq, 0), 0) -> true
app2(app2(eq, 0), app2(s, y)) -> false
app2(app2(eq, app2(s, x)), 0) -> false
app2(app2(eq, app2(s, x)), app2(s, y)) -> app2(app2(eq, x), y)
app2(app2(app2(if, true), x), y) -> x
app2(app2(app2(if, false), x), y) -> y
app2(minsort, nil) -> nil
app2(minsort, app2(app2(cons, x), y)) -> app2(app2(cons, app2(app2(min, x), y)), app2(minsort, app2(app2(del, app2(app2(min, x), y)), app2(app2(cons, x), y))))
app2(app2(min, x), nil) -> x
app2(app2(min, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(le, x), y)), app2(app2(min, x), z)), app2(app2(min, y), z))
app2(app2(del, x), nil) -> nil
app2(app2(del, x), app2(app2(cons, y), z)) -> app2(app2(app2(if, app2(app2(eq, x), y)), z), app2(app2(cons, y), app2(app2(del, x), z)))
app2(app2(map, f), nil) -> nil
app2(app2(map, f), app2(app2(cons, x), xs)) -> app2(app2(cons, app2(f, x)), app2(app2(map, f), xs))
app2(app2(filter, f), nil) -> nil
app2(app2(filter, f), app2(app2(cons, x), xs)) -> app2(app2(app2(app2(filter2, app2(f, x)), f), x), xs)
app2(app2(app2(app2(filter2, true), f), x), xs) -> app2(app2(cons, x), app2(app2(filter, f), xs))
app2(app2(app2(app2(filter2, false), f), x), xs) -> app2(app2(filter, f), xs)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 0 SCCs with 2 less nodes.